Nearest neighbor decoding for additive non-Gaussian noise channels
نویسنده
چکیده
We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original channel. The results are presented for single-user channels as well as multiple-access channels, and are extended to fading channels with side information at the receiver. Zndex TermsNearest neighbor decoding, Euclidean distance, mismatched decoding, multiple-access channel, generalized cutoff rate, fading.
منابع مشابه
Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels
We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we investigate the behavior of these achievable rates in the limit as the signalto-noise ratio (SNR) tends to infinity by analyzing the capacity pre-log, which is def...
متن کاملMaximum Likelihood Decoding of Convolutional Codes for Non-Gaussian Channels
The Viterbi algorithm plays a fundamental role in the design of receivers for digital communication systems corrupted by Gaussian noise. This algorithm arises as the maximum likelihood sequence detector of the transmitted data symbols in several applications, including equalization for channels subject to intersymbol interference, multiuser communications, and the detection of convolutionally e...
متن کاملThe Reliability Function for the Additive White Gaussian Noise Channel at Rates above the Capacity
We consider the additive white Gaussian noise channels. We prove that the error probability of decoding tends to one exponentially for rates above the capacity and derive the optimal exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem. Keywords—Additive white Gaussian noise channels, Strong converse theorem, Information s...
متن کاملMismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit
The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly ...
متن کاملA Comparative Study of Unipolar OFDM Schemes in Gaussian Optical Intensity Channel
We study the information rates of unipolar orthogonal frequency division multiplexing (OFDM) in discrete-time optical intensity channels (OIC) with Gaussian noise under average optical power constraint. Several single-, double-, and multicomponent unipolar OFDM schemes are considered under the assumption that independent and identically distributed (i.i.d.) Gaussian or complex Gaussian codebook...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996